HW4
===

Q1a
===
0 |
1 | 4371
2 |
3 | 1323 -> 6173
4 | 4344
5 | 
6 | 
7 |
8 | 
9 | 4199 -> 9679 -> 1989

Q1b
===
0 | 9679
1 | 4371
2 | 1989
3 | 1323
4 | 6173
5 | 4344
6 | 
7 |
8 | 
9 | 4199


Q2
==
Chaining
Adv : 
easy to understand and implement. allow (basically) infinite number of hasing. normal deletion possible
Disadv:
may get very long chain which makes searching inefficient. need 2 data structures.

Open Addressing - Linear
Adv :
easy, understandable.
Disadv : 
may get cluster. table may get filled which disallow insertion.

Open Addressing - Quadratic
Adv : 
no primary clustering
Dis : 
insertion may fail when table is more than half full. secondary clustering

Double
Adv : 
if wisely implemented, can get good performance
Dis : 
need 2 hashings. usually slower than the above methods.